关键词: 数据挖掘, 序列模式, 增量式挖掘, 频繁序列树, 投影数据库, 剪枝策略

Abstract: This paper proposes an incremental mining algorithm of sequential patterns based on frequent sequence tree, called ISFST, in order to solve the problem that the existed incremental mining algorithms can not make full use of the results of the previous mining, when the database is updated, the algorithms need to mine the database once again. ISFST uses the frequent sequence tree as the storage structure of the algorithm. When the database is updated, ISFST is divided into two kinds of situations to update the frequent sequence tree, and finally gets all sequential patterns. Experiments show that ISFST outperforms PrefixSpan and IncSpan in time cost.

Key words: data mining, sequential patterns, incremental mining, frequent sequence tree, projected database, pruning strategy